The Andrews–Sellers family of partition congruences
نویسندگان
چکیده
In 1994, James Sellers conjectured an infinite family of Ramanujan type congruences for 2-colored Frobenius partitions introduced by George E. Andrews. These congruences arise modulo powers of 5. In 2002 Dennis Eichhorn and Sellers were able to settle the conjecture for powers up to 4. In this article, we prove Sellers' conjecture for all powers of 5. In addition, we discuss why the Andrews-Sellers family is significantly different from classical congruences modulo powers of primes.
منابع مشابه
ARITHMETIC PROPERTIES OF m–ARY PARTITIONS WITHOUT GAPS
Motivated by recent work of Bessenrodt, Olsson, and Sellers on unique path partitions, we consider partitions of an integer n wherein the parts are all powers of a fixed integer m ≥ 2 and there are no “gaps” in the parts; that is, if m is the largest part in a given partition, then m also appears as a part in the partition for each 0 ≤ j < i. Our ultimate goal is to prove an infinite family of ...
متن کاملCongruences for Generalized Frobenius Partitions with an Arbitrarily Large Number of Colors
In his 1984 AMS Memoir, George Andrews defined the family of k–colored generalized Frobenius partition functions. These are enumerated by cφk(n) where k ≥ 1 is the number of colors in question. In that Memoir, Andrews proved (among many other things) that, for all n ≥ 0, cφ2(5n+3) ≡ 0 (mod 5). Soon after, many authors proved congruence properties for various k–colored generalized Frobenius part...
متن کاملComputational Proofs of Congruences for 2-colored Frobenius Partitions
1. Background and introduction. In his 1984 Memoir of the American Mathematical Society, Andrews [2] introduced two families of partition functions, φk(m) and cφk(m), which he called generalized Frobenius partition functions. In this paper, we will focus our attention on one of these functions, namely cφ2(m), which denotes the number of generalized Frobenius partitions of m with 2 colors. In [2...
متن کاملInfinite Families of Strange Partition Congruences for Broken 2-diamonds
In 2007 George E. Andrews and Peter Paule [1] introduced a new class of combinatorial objects called broken k-diamonds. Their generating functions connect to modular forms and give rise to a variety of partition congruences. In 2008 Song Heng Chan proved the first infinite family of congruences when k = 2. In this note we present two non-standard infinite families of broken 2-diamond congruence...
متن کاملCongruences for Andrews’ Spt-function
Congruences are found modulo powers of 5, 7 and 13 for Andrews’ smallest parts partition function spt(n). These congruences are reminiscent of Ramanujan’s partition congruences modulo powers of 5, 7 and 11. Recently, Ono proved explicit Ramanujan-type congruences for spt(n) modulo ` for all primes ` ≥ 5 which were conjectured earlier by the author. We extend Ono’s method to handle the powers of...
متن کامل